Evolving Images Using Transparent Overlapping Polygons

نویسندگان

  • William Tarimo
  • Chen Xing
  • Linyu Dong
  • Chao Li
چکیده

Our project attempted to use machine learning to recreate or redefine features of an image using an arrangement of transparent overlapping polygons. From genetic algorithm[1] and hill climbing[2], we came up an implementation that starts by generating a random sequence of polygons then iteratively mutating the sequence (slightly modifying a random attribute of a random polygon), incrementally building on mutations that yield results that are closer to a target image[3]. In the context of evolving images using polygons, we learned and explored the balance between visual appeal of the generated images and the efficiency of the implementation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Validation of Volunteered Geographic Information Landuse Change Using Satellite Imagery

Land use change monitoring is one of the main concerns of managers and urban planners due to human activities and unbalanced physical development in urban areas. In this paper, a combination of remote sensing data and volunteered geographic information was used to assess the quality of volunteered geographic information on land use and land cover changes monitoring. For this purpose, the ORBVIE...

متن کامل

Overlapping Area Computation between Irregular Polygons for Its Evolutionary Layout Based on Convex Decomposition

Low efficiency of interference calculation has become the bottleneck that restricts further development of the performance of evolutionary algorithm for the polygon layout. To solve the problem, in this paper, we propose an algorithm of calculating overlapping area between two irregular polygons. For this algorithm, at first, two irregular polygons are respectively decomposed into the minimum n...

متن کامل

Column-Based Strip Packing Using Ordered and Compliant Containment

The oriented strip packing problem is very important to manufacturing industries: given a strip of xed width and a set of many (> 100) nonconvex polygons with 1, 2, 4, or 8 orientations permitted for each polygon, nd a set of translations and orientations for the polygons that places them without overlapping into the strip of minimum length. Heuristics are given for two versions of strip packin...

متن کامل

Window Queries On Planar Subdivisions Arising From Overlapping Polygons

We present efficient algorithms for partitioning 2dimensional space into faces arising from the boundaries of overlapping polygons. In particular, we examine the case where the partitioning arises from overlaying m k-sided simple polygons. A dynamic data structure is presented for storing the partitioning that arises from m polygons with at most k sides each in space O(km) if the polygons are a...

متن کامل

A Neural Network for Simultaneously Reconstructing Transparent and Opaque Surfaces

This paper presents a neural network (NN) to recover threedimensional (3D) shape of an object from its multiple view images. The object may contain non-overlapping transparent and opaque surfaces. The challenge is to simultaneously reconstruct the transparent and opaque surfaces given only a limited number of views. By minimizing the pixel error between the output images of this NN and teacher ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013